Approximate Update of Logical Databases

In 6, 7], we presented syntactic characterizations and algorithms for computing the result of updating and revising a logical database under various approaches proposed in the literature. In this paper we focus on the design of versions of these algorithms able to provide an approximate answer if interrupted before completion. We use the PMA approach to update 18] as the main example, but the results readily generalize to a wide family of update operators.